Blocking sets in block designs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blocking sets in handcuffed designs

In this paper we determine the spectrum of possible cardinalities of a blocking set in a H(v,3,A) and in a H(v,4,1). Moreover we construct, for each admissible ~9, a H(v,3,1) without blocking sets. Introduction A handcuffed design with parameters v, k, A, or for short an H(v,k,A), consists of a set of ordered k-subsets of a v-set, called handcuffed blocks. In a block (a., a z ' ... ,a!:) each e...

متن کامل

Blocking sets in balanced path designs

Let k ~ 3. For each admissible v, we determine the set BS1i ( v, k, 1) of integers x such that there exists a balanced path design H ( v, k, 1) with a blocking set of cardinality x.

متن کامل

G-designs without blocking sets, Note

For an undirected graph G and a natural number n, a G-design of order n is an edge partition of the complete graph Kn with n vertices into subgraphs G1, G2, . . . , each isomorphic to G. A set T ⊂ V (Kn) is called a blocking set if it meets the vertex set V (Gi) of each Gi in the decomposition, but contains none of them. In a previous paper [J. Combin. Designs 4 (1996), 135–142] the first and t...

متن کامل

Blocking Sets in (v, {2, 4}, 1)-Designs

The existence of blocking sets in (v, {2, 4}, 1)-designs is examined. We show that for v ≡ 0, 3, 5, 6, 7, 8, 9, 11 (mod 12), blocking sets cannot exist. We prove that for each v ≡ 1, 2, 4 (mod 12) there is a (v, {2, 4}, 1)-design with a blocking set with three possible exceptions. The case v ≡ 10 (mod 12) is still open; we consider the first four values of v in this situation.

متن کامل

On Defining Sets of Full Designs with Block Size Three

A defining set of a t-(v, k, λ) design is a subcollection of its blocks which is contained in no other t-design with the given parameters, on the same point set. A minimal defining set is a defining set, none of whose proper subcollections is a defining set. The spectrum of minimal defining sets of a design D is the set {|M | | M is a minimal defining set of D}. We show that if a t-(v, k, λ) de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1985

ISSN: 0097-3165

DOI: 10.1016/0097-3165(85)90109-8